Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
81	COMBINATORIAL BOOTSTRAP INFERENCE IN PARTIALLY IDENTIFIED INCOMPLETE STRUCTURAL MODELS: SUPPLEMENTARY MATERIAL MARC HENRY, ROMUALD MEANGO AND MAURICE QUEYRANNE 1. Min-Cut Max-Flow Theorem Add to Reading List Source URL: www.qeconomics.org Language: English - Date: 2014-11-24 16:20:38 Combinatorics Flow network Ford–Fulkerson algorithm Maximum flow problem Max-flow min-cut theorem Cut Network flow Graph theory Mathematics
82	COMBINATORIAL BOOTSTRAP INFERENCE IN PARTIALLY IDENTIFIED INCOMPLETE STRUCTURAL MODELS: SUPPLEMENTARY MATERIAL MARC HENRY, ROMUALD MEANGO AND MAURICE QUEYRANNE 1. Min-Cut Max-Flow Theorem Add to Reading List Source URL: qeconomics.org Language: English - Date: 2014-11-24 16:20:38 Combinatorics Flow network Ford–Fulkerson algorithm Maximum flow problem Max-flow min-cut theorem Cut Network flow Graph theory Mathematics
83	Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗ Christian Borgs∗ Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2008-01-13 21:45:10 Combinatorics Flow network Operations research Connectivity Directed acyclic graph Minimum cut Axiom Network theory Networks Graph theory Network flow Mathematics
84	Capacitated Network Design on Undirected Graphs Deeparnab Chakrabarty∗ Ravishankar Krishnaswamy† Shi Li‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-06-17 04:09:52 Network flow Graph connectivity Operations research Maximum flow problem Max-flow min-cut theorem Flow network Graph Cut Minimum cut Graph theory Mathematics Combinatorial optimization
85	Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing Ravishankar Krishnaswamy∗ Viswanath Nagarajan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-12 10:28:36 Combinatorics Combinatorial optimization Flow network Cluster analysis Max-flow min-cut theorem Cut Minimum-cost flow problem Maximum flow problem CURE data clustering algorithm Graph theory Network flow Mathematics
86	I074 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN, VOL. 11, NO. 9, SEPTEMBER 1992 New Spectral Methods for Ratio Cut Partitioning and Clustering Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:45 Combinatorial optimization Graph partition Singular value decomposition Matrix theory Algebraic graph theory Eigenvalues and eigenvectors Adjacency matrix Cut Hypergraph Mathematics Algebra Graph theory
87	RESEARCH FEATURE Self-Organization and Identification of Web Communities Despite its decentralized and unorganized nature, the Web self-organizes Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-12-04 14:11:42 Network flow Combinatorial optimization Search algorithms PageRank Cut Flow network Maximum flow problem Algorithm Hyperlink Mathematics Graph theory Theoretical computer science
88	Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology, Cambridge, Massachusetts AND Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 Network flow Combinatorial optimization Flow network Maximum flow problem Minimum cut Cut Max-flow min-cut theorem Connectivity Graph partition Mathematics Graph theory Theoretical computer science
89	International Scholarly Research Network ISRN Communications and Networking Volume 2012, Article ID[removed], 19 pages doi:[removed][removed]Review Article Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-14 11:59:42 Connectivity Maximum flow problem Topology Cut Connected component Breadth-first search Disjoint-set data structure Pseudoforest Centrality Graph theory Mathematics Graph connectivity
90	Robust Approximation of CSPs V´ıctor Dalmau (joint work with A. Krokhin) Universitat Pompeu Fabra Robust Approximation of CSPs – p. 1/3 Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-08-15 16:22:53 Combinatorial optimization NP-complete problems Computational complexity theory Approximation algorithm Maximum cut Cut Constraint programming Constraint satisfaction problem Theoretical computer science Graph theory Mathematics

UPDATE